-
1 счетчик итераций
Русско-английский словарь по вычислительной технике и программированию > счетчик итераций
-
2 индекс итерации
-
3 счетчик итераций
Русско-английский большой базовый словарь > счетчик итераций
-
4 итерация
-
5 итерация
Русско-английский словарь по информационным технологиям > итерация
-
6 глубина итерации
Русско-английский большой базовый словарь > глубина итерации
-
7 метод итерации
-
8 итерация
ж. iteration -
9 счётчик итераций
Information technology: iteration counter -
10 счетчик циклов
1. repetition counterсчетчик тактов; счетчик циклов — step counter
2. step counter3. cycle counter4. cycle index counter5. loop counter
См. также в других словарях:
Iteration — It er*a tion, n. [L. iteratio.] 1. Recital or performance a second time; repetition. Bacon. [1913 Webster] What needs this iteration, woman? Shak. [1913 Webster] 2. (Computers) The execution of a statement or series of statements in a loop which… … The Collaborative International Dictionary of English
Loop counter — In software engineering, a loop counter is the term often used to refer to the variable that controls the iterations of a loop (a computer programming language construct). It is so named because most uses of this construct result in the variable… … Wikipedia
OpenMP — Original author(s) OpenMP Architecture Review Board[1] Developer(s) OpenMP Architecture Review Board … Wikipedia
Cross-entropy method — The cross entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach to combinatorial and continuous multi extremal optimization and importance sampling. The method originated from the field of rare event simulation,… … Wikipedia
Line search — In (unconstrained) optimization, the line search strategy is one of two basic iterative approaches to finding a local minimum mathbf{x}^* of an objective function f:mathbb R^n omathbb R. The other method is that of trust regions.… … Wikipedia
Backtracking line search — In (unconstrained) optimization, the backtracking linesearch strategy is used as part of a linesearch method, to compute how far one should move along a given search direction.MotivationUsually it is undesirable to exactly minimize the function… … Wikipedia
For loop — In computer science a for loop is a programming language statement which allows code to be repeatedly executed. A for loop is classified as an iteration statement.Unlike many other kinds of loops, such as the while loop, the for loop is often… … Wikipedia
Iterator — In computer science, an iterator is an object which allows a programmer to traverse through all the elements of a collection, regardless of its specific implementation. An iterator is sometimes called a cursor, especially within the context of a… … Wikipedia
Control flow — Not to be confused with Flow control. In computer science, control flow (or alternatively, flow of control) refers to the order in which the individual statements, instructions, or function calls of an imperative or a declarative program are… … Wikipedia
Generator (computer science) — In computer science, a generator is a special routine that can be used to control the iteration behaviour of a loop. A generator is very similar to a function that returns an array, in that a generator has parameters, can be called, and generates … Wikipedia
Prisoner's dilemma — This article is about game theory. For the 1988 novel, see Prisoner s Dilemma (novel). For the Doctor Who audiobook, see The Prisoner s Dilemma. For the 2001 play, see The Prisoner s Dilemma (play). The prisoner’s dilemma is a canonical example… … Wikipedia